Detecting and handling large flows

ABSTRACT

Some embodiments provide a forwarding element that detects and handles elephant flows. In detecting, the forwarding element of some embodiments monitors statistics or measurements relating to a data flow. In handling, the forwarding element marks each packet associated with a detected elephant flow in some manner to differentiate it from a packet associated with a mouse flow. Alternatively, the forwarding element of break elephant flows into a number mouse flow by facilitating in sending packets associated with the detected elephant flow along different paths.

CLAIM OF BENEFIT TO PRIOR APPLICATIONS

This application is a continuation application of U.S. patent application Ser. No. 14/231,647, filed Mar. 31, 2014, now published as U.S. Patent Publication 2015/0163144. U.S. patent application Ser. No. 14/231,647 claims the benefit of U.S. Provisional Patent Application 61/913,899, entitled “Detecting and Handling Elephant Flows”, filed on Dec. 9, 2013. U.S. patent application Ser. No. 14/231,647 and U.S. Provisional Patent Application 61/913,899 are incorporated herein by reference.

BACKGROUND

Today, a datacenter may process different types of flows, including elephant flows and mouse flows. An elephant flow represents a long-lived flow or a continuous traffic flow that is typically associated with high volume connection. Different from an elephant flow, a mouse flow represents a short-lived flow. Mice are often associated with bursty, latency-sensitive applications, whereas elephants tend to be associated with large data transfers in which throughput is far more important than latency.

A problem with elephant flows is that they tend to fill network buffers end-to-end, and this introduces non-trivial queuing delay to anything that shares these buffers. For instance, a forwarding element may be responsible for managing several queues to forward packets, and several packets belonging to a mouse flow may be stuck in the same queue behind a group of other packets belonging to an elephant flow. In a network of elephants and mice, this means that the more latency-sensitive mice are being affected. Another problem is that mice are generally very bursty, so adaptive routing techniques are not effective with them.

BRIEF SUMMARY

Embodiments described herein provide a forwarding element that detects and handles elephant flows. In detecting, the forwarding element of some embodiments monitors statistics or measurements relating to a data flow. As an example, the forwarding element may track the number of bytes sent in the data flow, and specify, based on the number of bytes, whether the data flow should be classified as elephant flow. In some embodiments, the forwarding element performs the monitoring on a per data flow basis by tracking statistics associated with a flow entry (e.g., in a flow table) that is used to process packets.

In some embodiments, the forwarding element is an edge forwarding element. The edge forwarding element is in a unique position to monitor data flows because it represents a last forwarding element before one or more end machine. For instance, the edge forwarding element may be communicatively coupled to a particular machine. The forwarding element can then detect an elephant flow by directly monitoring outbound packets from the particular machine. Alternatively or conjunctively with outbound packets, the forwarding element can detect an elephant flow by directly monitoring inbound packets to the particular machine.

The forwarding element of some embodiments monitors tunneled traffic to detect elephant flows. In some embodiments, the forwarding element is a tunnel endpoint that operates in conjunction with another tunnel endpoint to monitor and detect elephant flows at either ends of the tunnel. As an example, in detecting elephant flows, a first forwarding element at one end of the tunnel may monitor outbound packets from a first network host to a second network host, and a second forwarding element at the other end of the tunnel may monitor outbound packets from the second network host to the first network host.

As mentioned above, the forwarding element of some embodiments tracks the number of bytes sent to detect an elephant flow. In conjunction with byte count or instead of it, the forwarding element of some embodiments factors in time. As an example, the forwarding element might detect an elephant flow solely based on the duration of the data flow. That is, if the duration of the data flow is over a set period of time, the forwarding might determine that the data flow is an elephant flow. Also, instead of byte count, the forwarding element might calculate data transfer rate (e.g., bytes per second) that identifies rate at which the data is transferring over a given time period. The data transfer rate can be used to allow an elephant flow with slow data transfer rate to progress as normal. This is because such an elephant flow may not be contributing or at least significantly contributing in the latency of other data flows, such as mice flows and non-detected elephant flows.

Once an elephant flow is detected, the forwarding element of some embodiments treats the flow differently than a mouse flow. In some embodiments, a first forwarding element marks each packet associated with a detected elephant flow in some manner to differentiate it from other packets. The packet is then sent over the network and received at a second forwarding element at the next hop or some other subsequent hop. The second forwarding element then uses the marking to process the packet different from other packets associated with other data flows in order to reduce any delays caused by the detected elephant flow in processing the other packets associated with the other data flows. The second element may perform a quality of service (QOS) operation on the packet. For instance, the second forwarding element may place the packet in a particular queue different from one or more other queues used to process other packets (e.g., packets associated with mice flows and non-detected elephant flows). In this manner, one set of packets belonging to a mouse flow is not held in the same queue behind another set of packets belonging to an elephant flow for a prolonged period of time.

In some embodiments, the forwarding sets at least one bit in the packet's header to indicate that the packet belongs to the detected elephant flow. As an example, the forwarding element of some embodiments sets a (Differentiated Services Code Point) DSCP bit in the packet's header and allows the fabric (e.g., another forwarding element in the network) to handle the packet through standard queuing mechanisms. The DSCP bit or some other bit may be set in the packet's tunnel header. The DSCP field provides different levels of service to be assigned to network traffics, such as IP packets. However, if there is no encapsulation, the actual packet can be marked with a marking.

In some embodiments, the forwarding element facilitates in breaking an elephant flow into a number of mouse flows. The basic idea here is to split an elephant follow up into a bunch of mouse flows (e.g., by using more than one ephemeral source port for the flow). This approach has the nice property that the fabric remains simple and uses a single queuing and routing mechanism for all traffic. One way to implement this in an overlay network is to modify the ephemeral port of the outer header to create the necessary entropy needed by the multipathing hardware. In some embodiments, the forwarding element performs a traceroute to identify a network map and chooses different paths based on the network map.

In addition, several embodiments that detect an elephant flows based on the size of a packet are described in U.S. patent application Ser. No. 14/231,652, entitled “Detecting an Elephant Flow Based on the Size of a Packet”, filed Mar. 31, 2014, and now issued as U.S. Pat. No. 9,548,924. Some embodiments that report elephant flows to a network controller are described in U.S. patent application Ser. No. 14/231,654, entitled “Reporting Elephant Flows to a Network Controller, filed Mar. 31, 2014, and now issued as U.S. Pat. No. 10,158,538. These U.S. Patent Applications are incorporated herein by reference. In addition, some embodiments provide a system that detects an elephant flow by examining the operations of a machine. In some embodiments, the machine is a physical machine or a virtual machine (VM). In detecting, the system identifies an initiation of a new data flow associated with the machine. The new data flow can be an outbound data flow or an inbound data flow. The system then determines, based on the amount of data being sent or received, if the data flow is an elephant flow.

The preceding Summary is intended to serve as a brief introduction to some embodiments as described herein. It is not meant to be an introduction or overview of all subject matter disclosed in this document. The Detailed Description that follows and the Drawings that are referred to in the Detailed Description will further describe the embodiments described in the Summary as well as other embodiments. Accordingly, to understand all the embodiments described by this document, a full review of the Summary, Detailed Description and the Drawings is needed. Moreover, the claimed subject matters are not to be limited by the illustrative details in the Summary, Detailed Description and the Drawings, but rather are to be defined by the appended claims, because the claimed subject matters can be embodied in other specific forms without departing from the spirit of the subject matters.

BRIEF DESCRIPTION OF THE DRAWINGS

The novel features of the invention are set forth in the appended claims. However, for purposes of explanation, several embodiments of the invention are set forth in the following figures.

FIG. 1 conceptually illustrates a process that some embodiments use to detect an elephant flow using statistical data associated with a flow entry.

FIG. 2 provides an illustrative example of a physical forwarding element that detects elephants using statistical data associated with flow entries.

FIG. 3 illustrates an example of how a forwarding element retrieves statistic relating to a microflow.

FIG. 4 conceptually illustrates a process that some embodiments use mark packets associated with an elephant flow.

FIG. 5 provides an illustrative example how a forwarding element treats a packet marked with such a marking.

FIG. 6 conceptually illustrates a process that some embodiments use to break elephants into mice.

FIG. 7 shows an example of a forwarding element that assigns a particular source port to a packet so that the packet is sent over a particular route.

FIG. 8 shows the forwarding element assigning a different source port to another packet so that the packet is sent over different route.

FIG. 9 illustrates an example of tagging several packets in a detected elephant flow.

FIG. 10 illustrates an example of how a receiver uses a buffer to temporarily store packets that are received out of order.

FIG. 11 illustrates an example of how one or more packets in the buffer is sent to a recipient.

FIG. 12A shows an example of performing a traceroute to identify a network map.

FIG. 12B illustrates an example of using the network map to choose different paths.

FIG. 13 conceptually illustrates an electronic system with which some embodiments of the invention are implemented.

DETAILED DESCRIPTION

In the following detailed description of the invention, numerous details, examples, and embodiments of the invention are set forth and described. However, it will be clear and apparent to one skilled in the art that the invention is not limited to the embodiments set forth and that the invention may be practiced without some of the specific details and examples discussed.

Embodiments described herein provide a forwarding element that detects and handles elephant flows. In detecting, the forwarding element of some embodiments monitors statistics or measurements relating to a data flow. As an example, the forwarding element may track the number of bytes sent in the data flow, and specify, based on the number of bytes, whether the data flow should be classified as elephant flow. In some embodiments, the forwarding element performs the monitoring on a per data flow basis by tracking statistics associated with a flow entry (e.g., in a flow table) that is used to process packets.

Once an elephant flow is detected, the forwarding element of some embodiments treats it differently than a mouse flow. In some embodiments, the forwarding element marks each packet associated with a detected elephant flow in some manner to differentiate it from a packet associated with a mouse flow. The packet is then sent over the network and received at a next hop or some other subsequent hop that recognizes the mark. Thereafter, the packet is placed in a particular queue different from one or more other queues used to process other packets (e.g., packets associated with mice flows and non-detected elephant flows). In this manner, one set of packets belonging to a mouse flow is not held in the same queue behind another set of packets belonging to an elephant flow for a prolonged period of time.

In some embodiments, the forwarding element facilitates in breaking an elephant flow into a number of mouse flows. The basic idea here is to split an elephant up into a bunch of mice (e.g., by using more than one ephemeral source port for the flow). This approach has the nice property that the fabric remains simple and uses a single queuing and routing mechanism for all traffic. One way to implement this in an overlay network is to modify the ephemeral port of the outer header to create the necessary entropy needed by the multipathing hardware.

Several example detection and handling mechanisms will be described in detail below. In particular, Section I describes several example techniques for detecting elephant flows based on a threshold value. This is followed by Section II that describes several example handling a detected elephant flow by marking packets associated with elephant flow with a marking. Section III then several examples of handling a detected elephant flow by breaking the elephant flow into a number of mouse flows. Section IV then describes an electronic system for implementing some embodiments of the invention.

I. Detecting Elephant Flows Based on Statistics

In some embodiments, the forwarding element of some embodiments monitors at least one statistic or measurement relating to a data flow to determine whether the data flow should be classified as an elephant flow. For example, the forwarding element may track the number of bytes sent in a data flow, and specify, based on the number of bytes, whether the data flow should be classified as elephant flow. In some embodiments, the forwarding element performs the monitoring on a per data flow basis by tracking statistics associated with a rule or flow entry (e.g., in a flow table) that is used to process packets.

In monitoring, the forwarding element of some embodiments finds an elephant flow by updating and checking one or more counters (e.g., byte sent, packet sent) associated with a corresponding flow entry. As an example, the forwarding element might check whether the number of bytes sent has reached a certain threshold limit. When the threshold limit has been reached, the forwarding element then specifies that the data flow associated with the flow entry is an elephant flow. The term “packet” is used here as well as throughout this application to refer to a collection of bits in a particular format sent across a network. One of ordinary skill in the art will recognize that the term “packet” may be used herein to refer to various formatted collections of bits that may be sent across a network, such as Ethernet frames, TCP segments, UDP datagrams, IP packets, etc.

In some embodiments, the forwarding element of some embodiments may also take into account the duration of time that the flow entry has been in memory or cache to handle data transfer. For instance, the forwarding element of some embodiments periodically examines a cache to identify which flows remain in the cache to process packets while others flows timeout or expire. In some embodiments, the forwarding element calculates number of bytes sent over a specified time (e.g., bytes per second (Bps)). Alternatively, if the forwarding element finds a flow that is constantly being used to process packets, the forwarding element may specify the data flow associated with the flow entry as an elephant flow. For instance, the forwarding element may examine the packet count and determine whether a data flow should be categorized as an elephant flow based on the packet count.

In some embodiments, the forwarding element is an edge forwarding element (EFE). Different from a non-edge forwarding element (NEFE), the EFE is in a unique position to identify elephant flows. The EFE has the advantage over a NEFE in that it is the last forwarding element before one or more end machines (e.g., VMs, computing device). Thus, the EFE can more easily monitor traffic coming from and going to an end machine than a NEFE. Such dynamic detection is more difficult with a NEFE. For instance, performing the detection within the network by a NEFE can be difficult because of flow tracking in high-density switching application-specific integrated circuits (ASICs). A number of sampling methods have been proposed, such as sampling the buffers or using sFlow. However, the accuracy of such approaches remains unclear due to the sampling limitations at high speeds.

A. Example Process

Having described a brief overview of detecting elephant flows, an example process will now be described. FIG. 1 conceptually illustrates an example process 100 that some embodiments use to detect an elephant flow using statistical data associated with a data flow. In some embodiments, the process 100 is performed by a forwarding element.

The process 100 begins when it identifies (at 105) a data flow. The process 100 then retrieves (at 110) a statistic or measurement relating to the data flow. For example, the process 100 might retrieve a byte count, a packet count, and/or time associated with the flow. The byte count identifies the number of bytes sent using a rule or flow entry (in a flow table or a cache). The packet count identifies the number of packets sent in the data flow with the rule. The time identifies the duration of time that the rule has been in memory (e.g., in a flow table or cache) to process packets. In some embodiments, the process 100 computes bytes over a specified time and/or rate over a specified time to determine if a flow entry is associated with a data transfer session that is transferring large amounts of data.

At 115, the process 100 determines whether the statistical data is greater than a threshold value. If so, the process 100 specifies (at 120) that the data flow is an elephant flow. In specifying, the process 100 of some identifies one or more pieces of information that can be used to identify packets in the elephant data flow. The process 100 may identify tunnel information, such as the tunnel ID, the IP address of the source tunnel endpoint (e.g., the hypervisor), and the IP address of the destination tunnel endpoint. The process 100 of some embodiments identifies the elephant flow packet's ingress port, source transport layer (e.g., UDP or TCP) port, destination transport layer port, Ethernet type, source Ethernet address, destination Ethernet address, source IP address, and/or destination IP address.

If the statistical data is less than the threshold value, the process determines (at 125) whether to examine another flow entry. If there is another flow entry, the process 100 returns to 105, which is described above. Otherwise, the process 100 ends.

Some embodiments perform variations on the process 100. The specific operations of the process 100 may not be performed in the exact order shown and described. The specific operations may not be performed in one continuous series of operations, and different specific operations may be performed in different embodiments.

B. Example Implementation

An example implementation of a forwarding element that examines statistics will now be described. FIG. 2 provides an illustrative example of a forwarding element 200 that detects elephant flows using statistical data associated with different flow entries. The figure shows the forwarding element 200 at three different times (T1-T3).

In the example of FIG. 2, the forwarding element 200 is a software forwarding element, such as Open vSwitch. The software forwarding element operates on a computing device (e.g., x86 box). However, the forwarding element can be a hardware forwarding element that has hardware designed to support in hardware forwarding. For instance, the forwarding element may have application-specific integrated circuits (ASICs) with a Content Addressable Memory (CAM) or Ternary CAM (TCAM).

In some embodiments, the forwarding element is an edge forwarding element. The edge forwarding element is in a unique position to monitor data flows because it represents a last forwarding element before one or more end machine. For instance, the edge forwarding element may be communicatively coupled to a particular machine. The forwarding element can then detect an elephant flow by directly monitoring outbound packets from the particular machine. Alternatively or conjunctively with outbound packets, the forwarding element can detect an elephant flow by directly monitoring inbound packets to the particular machine.

The forwarding element of some embodiments monitors tunneled traffic to detect elephant flows. In some embodiments, the forwarding element is a tunnel endpoint that operates in conjunction with another tunnel endpoint to monitor and detect elephant flows at either ends of the tunnel. As an example, in detecting elephant flows, a first forwarding element at one end of the tunnel may monitor outbound packets from a first network host to a second network host, and a second forwarding element at the other end of the tunnel may monitor outbound packets from the second network host to the first network host.

In some embodiments, the forwarding element 200 (e.g., software or hardware) of some embodiments is a physical forwarding element that implements one or more logical forwarding elements with one or more other physical forwarding elements. For instance, the physical forwarding element may operate in conjunction with at least one other forwarding element to different logical forwarding element for different tenants, users, departments, etc. that use the same shared computing and networking resources. Accordingly, the term “physical forwarding element” is used herein to differentiate it from a logical forwarding element.

In the example of FIG. 2, the forwarding element 200 includes a userspace daemon 205, a kernel module 220, and a datapath cache 225. The userspace daemon 205 of some embodiments runs as a background process on a host machine. For instance, as its name implies, the userspace daemon may operate as a demon process in the userspace of the machine's operating system (OS). The daemon 205 of some embodiments receives management information and switch configuration (e.g., from one or more network controllers and/or a configuration database). The management information includes bridge and tunnel information, and the switch configuration includes various flows. These flows are stored in one or more flow tables (not shown).

The kernel module 220 accesses the datapath 225 to find matching flows to process packets. The datapath 225 contains any recently used flows. The flows may be fully specified, or may contain one or more match fields that are wildcarded, in some embodiments. Typically, a flow or rule includes a set of match fields to match against a set of header fields of a packet. The rule also includes a set of actions (e.g., one or more actions) to perform on the packet if the set of header fields matches the set of match fields. When the kernel module 220 receives the packet's header values or hashes of a hash of the header values, it tries to find a matching flow entry or rule installed in the datapath 225. If it does not find one, then the control is shifted to the userspace daemon 205.

To handle such cases, the userspace daemon 205 includes a flow installer 210. In some embodiments, the flow installer 210 is referred to in some embodiments as open flow protocol datapath interface (ofproto-dif). When there is a miss in the datapath 225, the flow installer 210 is called to install a rule (i.e., a flow entry) in the datapath cache based on one or more flows in a set of one or more flow tables. In this manner, the forwarding element 200 can quickly process each subsequent packet with the same set of header values using the rule in the datapath cache 225. The datapath cache 225 provides a fast path to process incoming packets because it does not involve any translation at the userspace by the userspace daemon 205.

In some embodiments, the forwarding element 200 includes a detection module 215 is responsible for detecting elephant flows. Conceptually, the detection module 210 module retrieves data relating to a flow entry in the datapath 225. The detection module 210 then compares the data against a threshold value to determine if the flow entry is associated with an elephant flow.

Different embodiments use different mechanisms to examine statistics or measurements relating to various flows. In some embodiments, the physical forwarding element 200 iterates through each flow (e.g., in the datapath cache or in a flow table) periodically and/or when triggered. For instance, the forwarding element may be configured with a rule or programed to validate each flow in the datapath cache every set period of time (e.g., every one second at minimum). Alternatively, or conjunctively, the physical forwarding element can be triggered to perform dynamic detection each time a flow entry or rule (e.g., in the datapath cache or in a flow table) is used to process a packet.

Having described several components of the forwarding element 200, an example operation of the forwarding element will now be described by reference to three time periods (T1-T3) that are shown in FIG. 2. In this example, the forwarding element is examining statistic relating to flows in the datapath 225. However, the flows could be stored anywhere (e.g., in a memory special space, such a TCAM, in a flow table, etc.).

At T1, the forwarding element 200 has three flow entries 230-240 in the datapath 225 to process incoming packets. Each flow entry is associated with statistical data, such as byte sent and packet sent. The flow installer 210 might have installed each of these flow entries to quickly process incoming packets. In the example of T1, the first flow entry 230 has been used to process one packet, the second flow entry 235 has been used to process a hundred packets, and third flow entry 240 has been used to process four packets. At this time (T1), the detection module might be examining data relating the flow entries 230-240 in order to find an elephant.

T2 represents sometime after T1. At T1, the forwarding element 200 now only has two flow entries 230 and 235 in the datapath 225 to process incoming packets. Particularly, the flow entry 240 has been removed from the datapath 225. In this example, the flow entry 240 was removed from the database cache 225 because it was no longer being used to process any incoming packets. In some embodiments, the userspace daemon 205 performs a flow eviction process to remove each flow that is no longer being used from the datapath 225. The flow eviction process determines if a flow entry in the datapath has expired and, if so, removes the flow entry from the datapath. For instance, if the flow entry has not been used for a set period of time, the userspace daemon 205 deletes the flow entry from the datapath 225. This feature prevents the datapath 225 from being filled with potentially many flow entries that has not been used for some time, which in turns speeds up the classifier lookup.

T2 shows that the flow entries 230 and 235 were used to process additional packets. Namely, the flow entry 230 has been used to process 50 packets, and the flow entry 235 has been used to process 500 packets. Again, at T2, the detection module 215 might be examining data relating each of the flow entries 230 and 235 in order to determine if the corresponding flow entry belongs to an elephant flow.

T3 represents sometime after T2. At T3, the forwarding element 200 now only has one flow entry 235 left in the datapath 225 to process packets. Specifically, the flow entry 230 has been removed from the datapath 225. The flow entry 230 was removed from the database cache because it was no longer being used to process packets. T3 also shows that the flow entry 235 has been used to process additional packets. In particular, the flow entry 235 has now been used to process 1000 packets.

At T3, the detection module 215 has retrieved data relating the flow entry 235. The detection module 215 has also compared the data against one or more threshold values. Based on the comparison, the detection module 215 has detected that the flow entry 235 as being associated with an elephant flow.

C. Flows with Wildcard Match Fields

The forwarding element of some embodiments supports match rules with wildcard match fields. Each rule may include one or more wildcard fields and/or one or more fields that are at least partially wildcarded. For instance, a first portion of an IP destination address match field may be fully specified, while the remaining portion of the IP address match field is wildcarded. The forwarding element uses such non-exact match rules to reduce the overhead in making packet forwarding decisions (e.g., at the userspace with the userspace daemon). In some embodiments, a rule with a wild card match field (or a portion of the match field wildcarded) is also referred to as a megaflow. The term “megaflow” is used to distinguish the flow from an exact match rule, also referred to herein as a “microflow”. A small number of megaflows installed into the kernel can process a diverse collection of packets, eliminating much overhead by sending fewer packets from the kernel to userspace.

The problem with such a megaflow is that it may be used to process multiple different data flows. The megaflow may be used process packets in an elephant flow, as well as a mouse flow. This is because at least one match field (or a portion thereof) is wildcarded or sub-masked. For instance, several different packets, which are associated with different data flows, can be processed by one wildcard flow as long as each packet has a set of header values that match a set of non-wildcard fields. Therefore, the statistical data associated with the megaflow may be unreliable data source to make a determination of whether a data flow should be classified as an elephant flow.

A first example solution to the megaflow problem is for the forwarding element to disable the megaflow feature when elephant detection feature is enabled. A second example solution would be to perform dynamically disable the megaflow feature. For instance, the forwarding element can periodically disable or shoot the megaflow feature and see which packets are sent up to userspace. The idea here is to periodically remove one or more megaflows from the datapath and check what gets reported. The forwarding element may then decide, based on the report, that a megaflow may be associated with an elephant flow. A third example solution to the megaflow problem is to sample what microflows are in the datapath. For instance, the forwarding element would sample the datapath periodically for different microflows. If a forwarding element encounters a same microflow multiple times, the forwarding element can check the flow's statistical data to determine if the microflow is associated with an elephant data flow.

In some embodiments, the forwarding element caches megaflows but also caches one or more microflows associated with each megaflow. That is, for each wildcard flow, the forwarding element can still keep track of each non-wildcard flow relating to the wildcard flow. For instance, the forwarding element can push down a wildcard flow into the datapath; however, on a per CPU basis, the forwarding element can have non-wildcard flows. Each of these non-wildcard flows can then be exposed or queried to retrieve the corresponding statistical data.

FIG. 3 illustrates an example of how a forwarding element 300 caches a megaflow 305 and the megaflow's corresponding microflows 310 and 315. In this example, the forwarding element 300 stores the megaflow 305 in a megaflow cache 335 and stores the microflows 310 and 315 in an exact match cache 340. In some embodiments, the kernel module 345 first consults the exact-match cache 340 to find a matching microflow. If a match is found, the kernel module 345 processes the packet using a matching microflow. If there is a miss in the exact match cache 345, the kernel module 345 may consult the megaflow cache 335. If there is a miss in the megaflow cache 335, the packet is sent to the userspace daemon 320. The daemon's flow installer 325 receive the packet and consult one or more flow tables (not shown) to generate a new flow (e.g., a megaflow). In some embodiments, the exact match cache 340 is populated on demand from the consulting megaflow cache 335.

In the example of FIG. 3, the elephant detector 330 of some embodiments examines statistical data associated with each of the two microflows 310 and 315 to determine whether the corresponding data flow should be classified as an elephant flow. That is, instead of examining statistical data relating to the megaflow 305, the elephant detector 330 examines statistical data relating to each of the two microflows 310 and 315.

Another alternate approach to the solving the megaflow problem is to perform recirculation. The recirculation can be performed at the kernel space with the kernel module 345, in some embodiments. Recirculation entails finding a matching flow in one table and performing a resubmit action to another table. For example, in the example of FIG. 3, the megaflow 305 may be associated with a “resubmit” action to consult the exact match cache 340. Here, the kernel module 345 would first check the megaflow cache 345 to match a packet against a megaflow. If there is a match and the megaflow specifies a resubmit action, the kernel module 345 may then consult to exact match cache to identify a microflow. Thereafter, the elephant detector can then examine the statistical data associated with the micro flow to determine if is associated with an elephant data flow.

II. Marking Packets Associated with an Elephant Flow

Once an elephant flow is detected, the forwarding element of some embodiments treats the flow differently than a mouse flow. In some embodiments, a first forwarding element marks each packet associated with a detected elephant flow in some manner to differentiate it from other packets. The packet is then sent over the network and received at a second forwarding element at the next hop or some other subsequent hop. The second forwarding element then uses the marking to process the packet different from other packets associated with other data flows in order to reduce any delays caused by the detected elephant flow in processing the other packets associated with the other data flows. The second element may perform a quality of service (QOS) operation on the packet. For instance, the second forwarding element may place the packet in a particular queue different from one or more other queues used to process other packets (e.g., packets associated with mice flows and non-detected elephant flows). In this manner, one set of packets belonging to a mouse flow is not held in the same queue behind another set of packets belonging to an elephant flow for a prolonged period of time.

In some embodiments, the forwarding sets at least one bit in the packet's header to indicate that the packet belongs to the detected elephant flow. As an example, the forwarding element of some embodiments sets a (Differentiated Services Code Point) DSCP bit in the packet's header and allows the fabric (e.g., another forwarding element in the network) to handle the packet through standard queuing mechanisms. The DSCP bit or some other bit may be set in the packet's tunnel header. However, if there is no encapsulation, the actual packet can be marked with a marking.

B. Example Process

Having described a brief overview of marking packets, an example process will now be described. FIG. 4 conceptually illustrates a process 400 that some embodiments use mark packets associated with an elephant flow. In some embodiments, the process 400 is performed by a forwarding element. The process 400 begins when it detects (at 405) an elephant flow.

In some embodiments, the process 400 detects an elephant flow based on one or more statistics associated with a data flow. The process of some embodiments the size of each of several packets in a data flow to determine whether the data flow is an elephant flow. The process inspects the size because, in order for the packet to be of a certain size, the data flow had to already have gone through a slow start in which smaller packets are transferred and by definition be an elephant flow. As an example, the Transmission Control Protocol (TCP) uses a slow start algorithm in order to avoid congesting the network with an inappropriately large burst of data. The TCP also uses the algorithm to slowly probe the network to determine the available capacity. The process of some embodiments takes advantage of such a slow start algorithm by using it to detect elephant flows.

The process 400 of some embodiments detects an elephant flow by examining the operations of a machine. The elephant flow represents a long-lived data flow or a continuous traffic flow that is associated with large data transfer. In some embodiments, the machine is a physical machine or a virtual machine (VM). In detecting, the process 400 identifies an initiation of a new data flow associated with the machine. The new data flow can be an outbound data flow or an inbound data flow. The process 400 then determines, based on the amount of data being sent or received, if the data flow is an elephant flow.

As shown in FIG. 4, the process 400 then identifies (at 410) a packet associated with the elephant flow. At 415, the process 400 marks the packet's header to indicate that the packet belongs to an elephant flow. For instance, the process 400 of some embodiments sets a DSCP bit in the packet's tunnel header. After marking the header, the process 400 then forwards (at 420) the packet to another forwarding element. Here, the process 400 marks the packet (e.g., sets the DSCP bit) and lets the fabric handle the packet through standard queuing mechanisms. An example queuing mechanism will be described below by reference to FIG. 7.

The process 400 then determines (at 425) whether there is another packet that is associated with the elephant flow. If so, the process 400 returns to 410, which is described above. Otherwise, the process 400 ends. Here, the process identifies an elephant flow and marks, based on the identification, packet headers (e.g., with DSCP (QOS) marking) before sending encapsulated packet to the physical fabric. The physical fabric uses this bit to assign packets to different internal queues. This prevents elephant connections ballooning or increasing the latency of mice connections, which are more likely to be about low-latency application operations.

Some embodiments perform variations on the process 400. The specific operations of the process 400 may not be performed in the exact order shown and described. The specific operations may not be performed in one continuous series of operations, and different specific operations may be performed in different embodiments.

B. Example Implementations

FIG. 5 provides an illustrative example marking a packet and processing the packet based on the marking. In particular, the figure shows an implementation of an edge forwarding element 500 that mark the packet associated with an elephant flow. The figure also shows an implementation of a non-edge forwarding element 525 that process the packet based on the marking. Four operational stages 505-520 of the forwarding elements 500 and 525 are shown in the figure.

In the first stage 505, the edge forwarding element 505 detects an elephant flow. The second stage 510 shows the edge forwarding element 505 marking a packet that belongs to the elephant flow. This is followed by the third stage 515, which shows the edge forwarding element 505 forwarding the packet 545 to the non-edge forwarding element 525.

In the fourth stage 520, the non-edge forwarding element 505 has received the packet from the edge forwarding element 525. Specifically, the packet 545 has been received by a Quality of Service (QOS) engine 530 that executes on the non-edge forwarding element 525. In this example, the non-edge forwarding element includes a number of queues (e.g., 535, 540, etc.). Typically, a forwarding element (e.g., top-of-rack switch) has several different queues (e.g., eight queues), and the forwarding element can be configured to specify how packets are placed into the different queues and how the queues are drained. Here, the QOS engine reads the marking, select the queue 540 based on the marking, and place the packet 545 in that selected queues. In this example, since the elephants and mice are all sharing the same infrastructure. The marking is used so that one or more packets belonging to a mouse flow is not stuck in a queue behind a group of packets belong to an elephant flow.

III. Breaking Elephants into Mice

In some embodiments, the forwarding element facilitates in breaking an elephant flow into a number of mouse flows. The basic idea here is to split an elephant follow up into a bunch of mouse flows (e.g., by using more than one ephemeral source port for the flow). This approach has the nice property that the fabric remains simple and uses a single queuing and routing mechanism for all traffic. One way to implement this in an overlay network is to modify the ephemeral port of the outer header to create the necessary entropy needed by the multipathing hardware.

A. Example Process

FIG. 6 conceptually illustrates a process 600 that some embodiments use to break elephants into mice. In some embodiments, the process 600 is performed by a forwarding element. The process 600 begins when it detects (at 605) an elephant flow. In some embodiments, the process 600 detects an elephant flow using one or more techniques described in Section I above. The process 600 then identifies (at 610) a packet associated with the elephant flow.

At 615, the process 600 assigns one of several different source ports to the packet. After marking the header, the process 600 then forwards (at 620) the packet to another forwarding element. The process 600 then determines (at 625) whether there is another packet that is associated with the elephant flow. If so, the process 600 returns to 610, which is described above. Otherwise, the process 600 ends.

Some embodiments perform variations on the process 600. The specific operations of the process 600 may not be performed in the exact order shown and described. The specific operations may not be performed in one continuous series of operations, and different specific operations may be performed in different embodiments.

B. Example Implementations

FIGS. 7 and 8 illustrate an example of how some embodiments break an elephant flow into a mouse flow. Specifically, FIG. 7 shows an example of a forwarding element 701 that assigns a particular source port to a packet so that the packet is sent over a particular route. This is followed by FIG. 8, which shows the forwarding element 701 assigning a different source port to another packet so that the packet is sent over different route. These figures show a number of forwarding elements 701-711. Each of these forwarding elements can be a switch, a router, or any other appliance that is capable of receiving and forwarding packets. To simplify the description, the figures show two edge forwarding elements (EFE 701 and EFE 711) and nine non-edge forwarding element (NEFEs 702-710). The NEFEs 703-709 elements conceptually represent, in some embodiments, a fabric or network topology in which traffic is spread across multiple physical links. Also, these figures show the EFE 701 forwarding packets to EFE 711.

Four operational stages 715-730 of a network 700 are shown in FIG. 7. The first stage 715 shows the EFE 701 detecting an elephant flow. The second stage 720 shows that, in response to the detection, the EFE 701 assigns a particular source port to the packet's outer header. For instance, the EFE 701 may assign a hash value to the transport layer (TCP or UDP) source port header field of the packet. The third stages 715 shows the EFE1 forwarding the packet to the NEFE 702. The fourth stage 720 shows that the NEFE 702 has received the packet. Here, the NEFE 702 chooses a particular equal-cost multi-path routing (ECMP) leg to route the packet based on the assigned source port. Standard equal ECMP methods entail hashing on address and port numbers in the outer protocol headers. Specifically, the NEFE 702 has chosen to forward the packet to NEFE 703. Accordingly, in the fourth stage 720, the NEFE 703 sends the packet to NEFE 703.

FIG. 8 shows three additional stages 805-815 of the network 700. These stages 805-815 are a continuation of the ones shown in the previous figure. The first stage 805 of FIG. 8 shows the EFE 701 encapsulating a next packet associated with the elephant flow. Specifically, the stage 805 illustrates that the EFE 701 assigns a different source port.

The second stage 815 shows the EFE 701 forwarding the next packet to the NEFE 702. The third stage 815 shows that the NEFE 702 has received the next packet. Here, the NEFE 702 breaks the elephant flow into a mouse flow by choosing another ECMP leg to route the next packet based on the different source port. Specifically, instead of NEFE 703 or NEFE 705, the NEFE 702 has chosen to forward the packet to NEFE 704. Accordingly, in the third stage 815, the NEFE 702 sends the packet to NEFE 704.

In the example described above, the core static ECMP is extended by edge sourced dynamic-load based entropy. That is, the overlays allow the system to repurpose the classic 5-tuple used for ECMP within the fabric. The 5-tuple comprising the source IP address, destination IP address, protocol type, TCP/UDP source port, and TCP/UDP destination port. A single logical connection does not need to translate into one outer (Stateless Transport Tunneling (STT), Virtual Extensible LAN (VXLAN)) 5-tuple for its lifetime but instead the system can use several outer 5-tuples over the lifetime of the connection. A practical way to achieve this is to reassign the outer source port after a set of packets has been sent over the logical connection. This will result in more uniform traffic distribution across the physical fabric links and hence more bandwidth available for the endpoints.

Also, in the example described above, a first forwarding assigns different header values (e.g., hashes) for different packets in a same data flow. The packets are then processed by a second forwarding to break the elephant data flow into one or more smaller mouse data flows. One of ordinary skill in the art would understand that these operations could be performed on one forwarding element rather than multiple forwarding element. For instance, a forwarding element of some embodiments can monitor a data flow associated with a network host to detect an elephant flow, and perform load balancing by sending traffic belonging to a detected elephant flow along different paths. The forwarding element may also generate different hashes to send traffic along the different paths.

C. Reordering Problem

One downside of using the STT protocol may be one of its prominent features: efficiently sending large contiguous blocks of data. Ideally, many small packets would be sent through different paths. However, the TCP segmentation offload (TSO) engine takes a large (up to 64 KB) TCP segment and breaks it into MTU-sized fragments with the same TCP header (and thus, source port). For instance, the forwarding element may calculate a hash of the inner packet headers, and place the hash in the outer source (e.g., UDP, TCP) port where it feeds into a link aggregation control protocol (LACP)/ECMP hash calculation. This means each segment will take the same path instead of multiple routes. On the other hand, when packets take multiple routes, they can introduce reordering due to different numbers of hops or queuing delays.

To prevent reordering, the system of some embodiments introduces additional state into a particular protocol, such as STT, VXLAN, etc. FIG. 9 illustrates an example of tagging several packets in a detected elephant flow. Specifically, this figure illustrates in four stages 905-920 how the EFE 701 adds additional state to each of several packets in the detected elephant flow. In this example, a small extension is be made to the protocol header (e.g., STT header) for handling tagged elephants. The header now includes an elephant flow identifier (ID). The identifier can be any number of bits that is wide enough to support various different elephant flows, such as 32-bit. In some embodiments, the header also includes a (e.g., 32-bit) sequence number counter. This sequence number is increments each time a packet is sent for the data flow.

When an elephant flow is detected, the sender's protocol stack (e.g., STT stack) can choose multiple source ports for the elephant flow. The sender can also use the same elephant flow ID and increment a sequence number counter for each successive packet. This is illustrated in the four stages 905-920 of FIG. 9. Specifically, in the first stage 905, the EFE 701 assign a particular elephant flow ID for each packet in a detected elephant flow. The EFE 701 has also assigned a sequence number to the first packet. In addition, the EFE 701 has assigned a hash value to the source port of the packet's outer header. In some embodiments, the hash value is generated by hashing a number of tuples (e.g., in the inner header).

In the second stage 910, the NEFE 2702 has received the first packet from the EFE 701. The NEFE 702 then forwards the first packet to a particular path based on the hash value. The second stage 910 also illustrates the EFE 701 sending second packet. The second packet is assigned the same elephant flow ID; however, the second packet's sequence number counter has been incremented by one, and a different hash value has been assigned to the source port of the second packet's outer header.

The third stage 915 is similar to the second stage 910. In particular, the NEFE 2702 has received the second packet from the EFE 701. The NEFE 702 then forwards the second packet to another path based on the hash value. The third stage 910 also illustrates the EFE 701 sending a third packet with the same elephant flow ID, an incremented sequence number, and another different hash value. The fourth stage 920 shows the NEFE 702 forwarding the third packet to another different path based on the third packet's associated hash value. Although not shown in FIG. 9, the version number of the protocol (e.g., STT) may be incremented to indicate that the protocol can be used to store state relating to an elephant flow.

The receiver opportunistically tries to forward segments (i.e., packets) to the recipient in sequential order according the sequence number counter. The receiver of some embodiments maintains a buffer that holds segments that are greater than the counter ID the receiver expects. In some embodiments, the receiver immediately gives the recipient any contiguous block that it can that begins with the counter ID that the receiver expects. If after a relatively small delay, the receiver does not have the counter ID it expects, but has later ones, the receiver forwards what each packet the receiver has to the recipient. The receiver of some embodiments always sets the expected counter ID to the last counter it forwarded. If a segment for an elephant flow comes in with a lower ID than expected, the receiver of some embodiments always immediately forwarded to the recipient. Alternatively, the receiver can just drop the future segments (i.e., out of order segments) if it is concerned about introducing reordering.

FIGS. 10 and 11 illustrate an example of how the receiver uses a buffer to temporarily store packets that are received out of order. Specifically, FIG. 10 illustrates an example of how a receiver uses a buffer to temporarily store packets that are received out of order. FIG. 11 illustrates an example of how one or more packets in the buffer is sent to a recipient. In these figures, the receiver is the EFE 711 and the recipient is the machine 1025.

Four stages 1005-1020 are shown in FIG. 10. The EFE 710 also includes a sequence number identifier 1030 for identifying the elephant flow ID and the sequence number associated with each packet and a buffer 1025 to store packets that are received out of order.

The first stage 1005 shows the EFE 711 receiving the first packet from the NEFE 710. The first packet is received in order. Accordingly, in the second stage 1010, the EFE 711 forwards the first packet to the machine 1025. The third stage 1015 shows the EFE 711 receiving the third packet from the NEFE 710. The third packet is received out of sequence. Accordingly, in the fourth stage 1020, the EFE 711 stores the packet is the buffer 1025.

Three stages 1105-1115 are shown in FIG. 11. These stages 1105-1115 are a continuation of the ones shown in the previous figure. In the first stage 1105 of FIG. 11, the EFE 711 receiving the second packet from the NEFE 710. The second packet is received in out of order. Here, after a relatively small delay, the EFE 711 has received the second packet. Accordingly, in the second stage 1110, the EFE 711 sends the second packet to the machine 1025. The third stage 1110 then shows the EFE emptying the buffer and sending the third packet to the machine 1025.

In the example described above, the system introduces additional state into a particular protocol, such as STT, VXLAN, etc. An alternate approach to handling the reordering is to overload the TCP timestamp option, which the network interface controller or card (NIC) dutifully duplicates on transmit and receive for each fragment or each maximum transmission unit (MTU) sized packet. In the timestamp option, the system would encode a similar elephant flow ID and counter. The positive in this is that that the receiver can immediately flush its cache for that elephant flow if it knows that any earlier fragment is missing. One downside of this approach is some additional complexity and copying the elephant flow identifier (ID) and counter into each fragment.

D. Choosing Legs

In some embodiments, the forwarding element performs a traceroute to identify a network map and chooses different paths for packets associated with an elephant flow. For instance, the forwarding element of some embodiment determines one tunnel source port for each possible Layer 3 (L3) path, e.g. using a variant of the Paris traceroute algorithm. Once determined, the forwarding element (e.g., the forwarding element daemon) performs a precise mapping from flow to tunnel source port (e.g., in userspace). The forwarding element then would not have to perform the hashing of each flow to the whole set of source ports. Instead, the forwarding element specifies several distinct subsets of tunnel source ports, which would take distinct sets of L3 paths in the fabric. As an example, the forwarding element can specify for each flow the specific subset of source ports it could be hashed to. In this manner, the forwarding element ensures that elephant flows take different paths by hashing them to different sets of tunnel source ports.

FIGS. 12A and 12B illustrate examples of (1) performing a traceroute operation to identify a network map and (2) forwarding packets along different chosen paths using the identified map. The figures show a network 1200 that includes several edge forwarding elements (EFEs) 1202 and 1212 and non-edge forwarding elements (NEFEs) 1204-1210.

FIG. 12A illustrates in two stages 1214 and 1216 how the EFE 1202 performs a traceroute to probe the network 1200 and identify a network map. In some embodiments, the EFE 1202 uses the Paris traceroute algorithm or a variation thereof to identify the network map. One reason for using such an algorithm is that typical traceroute algorithm can result in an inaccurate map of a network. This is especially true in cases where there is load balancing or multipathing in the network.

Two stages 1214 and 1216 are shown in FIG. 12. The first stage 1214 shows the EFE 1202 performing a traceroute to identify a first path in the network 1200. To map the path, the EFE 1202 sends a first packet (e.g., UDP or TCP packet) with a Time to Live (TTL) field set to one second to the NEFE 1204. The packet may be addressed to a particular network host (e.g., a destination machine). The NEFE 1204 receives the first packet then decrements the first packet's TTL value by one and returns a message (e.g., an Internet Control Message Protocol (ICMP) error message) which indicates that the specified time has been exceeded. The message includes information (e.g., an IP address) associated with the NEFE 1204. The EFE 1202 uses the information to identify the network map.

As shown in the first stage 1214, the EFE 1202 sends a second packet with the TTL field value incremented by one second to two seconds. The NEFE 1204 receives the second packet, decrements the second packet's TTL value by one second, and instead of returning an error message, forwards the second packet to the NEFE 1206. The NEFE 1206 receives the second packet and decrements the second packet's TTL and returns a message. The EFE 1202 then increments the time again and sends a third packet to identify the NEFE 1210. Lastly, the EFE 1204 sends the fourth packet with the TTL time incremented to identify the EFE 1212.

The second stage 1216 shows the EFE 1202 performing a traceroute to identify a second path in the network 1200. Here, the EFE 1202 performs similar probes as the first stage 1214. However, the NEFE 1204 sends each packet that it receives along the second path to the NEFE 1208. Here, the EFE 1202 might have randomize the source port value to a different value than the first stage 1214. In this way, the traceroute can map out the second available paths. In some embodiments, the EFE 1202 uses a same flow identifier for each path and maps one path at a time, as illustrated in FIG. 12A.

In some embodiments, Paris traceroute controls the probe header fields to allow all probes towards a destination to follow the same path in the presence of per-flow load balancing. Paris traceroute does this by varying header fields that are within the first 28 octets, but are not used for load balancing. For instance in TCP probes, Paris traceroute varies the sequence number. In UDP probes, it is the checksum field. This may require the manipulation of the payload to yield the desired checksum. In addition, for (Internet Control Message Protocol) ICMP probes, the algorithm may use a combination of the ICMP identifier and the sequence number. Paris traceroute sets the value of the ICMP identifier and sequence number to keep constant the header checksum of all probes to a destination.

FIG. 12B shows the EFE 1202 forwarding several packets associated with an elephant flow. Specifically, the figure shows in two stages 1218 and 1220 how the EFE 1202 uses the identified map to send the packets along the two different paths. In the first stage 1218, the EFE 1218 chooses the first path by assigning one value (e.g., hash value) for the source port for the packet's outer header. In the second stage 1205, the EFE 1202 chooses the second path by using another value for the source port for the packet's outer header.

IV. Electronic System

Many of the above-described features and applications are implemented as software processes that are specified as a set of instructions recorded on a computer readable storage medium (also referred to as computer readable medium). When these instructions are executed by one or more computational or processing unit(s) (e.g., one or more processors, cores of processors, or other processing units), they cause the processing unit(s) to perform the actions indicated in the instructions. Examples of computer readable media include, but are not limited to, CD-ROMs, flash drives, random access memory (RAM) chips, hard drives, erasable programmable read-only memories (EPROMs), electrically erasable programmable read-only memories (EEPROMs), etc. The computer readable media does not include carrier waves and electronic signals passing wirelessly or over wired connections.

In this specification, the term “software” is meant to include firmware residing in read-only memory or applications stored in magnetic storage, which can be read into memory for processing by a processor. Also, in some embodiments, multiple software inventions can be implemented as sub-parts of a larger program while remaining distinct software inventions. In some embodiments, multiple software inventions can also be implemented as separate programs. Finally, any combination of separate programs that together implement a software invention described here is within the scope of the invention. In some embodiments, the software programs, when installed to operate on one or more electronic systems, define one or more specific machine implementations that execute and perform the operations of the software programs.

FIG. 13 conceptually illustrates an electronic system 1300 with which some embodiments of the invention are implemented. The electronic system 1300 may be a computer (e.g., a desktop computer, personal computer, tablet computer, etc.), server, dedicated switch, phone, PDA, or any other sort of electronic or computing device. Such an electronic system includes various types of computer readable media and interfaces for various other types of computer readable media. Electronic system 1300 includes a bus 1305, processing unit(s) 1310, a system memory 1325, a read-only memory 1330, a permanent storage device 1335, input devices 1340, and output devices 1345.

The bus 1305 collectively represents all system, peripheral, and chipset buses that communicatively connect the numerous internal devices of the electronic system 1300. For instance, the bus 1305 communicatively connects the processing unit(s) 1310 with the read-only memory 1330, the system memory 1325, and the permanent storage device 1335.

From these various memory units, the processing unit(s) 1310 retrieves instructions to execute and data to process in order to execute the processes of the invention. The processing unit(s) may be a single processor or a multi-core processor in different embodiments.

The read-only-memory (ROM) 1330 stores static data and instructions that are needed by the processing unit(s) 1310 and other modules of the electronic system. The permanent storage device 1335, on the other hand, is a read-and-write memory device. This device is a non-volatile memory unit that stores instructions and data even when the electronic system 1300 is off. Some embodiments of the invention use a mass-storage device (such as a magnetic or optical disk and its corresponding disk drive) as the permanent storage device 1335.

Other embodiments use a removable storage device (such as a floppy disk, flash memory device, etc., and its corresponding drive) as the permanent storage device. Like the permanent storage device 1335, the system memory 1325 is a read-and-write memory device. However, unlike storage device 1335, the system memory 1325 is a volatile read-and-write memory, such a random access memory. The system memory 1325 stores some of the instructions and data that the processor needs at runtime. In some embodiments, the invention's processes are stored in the system memory 1325, the permanent storage device 1335, and/or the read-only memory 1330. From these various memory units, the processing unit(s) 1310 retrieves instructions to execute and data to process in order to execute the processes of some embodiments.

The bus 1305 also connects to the input and output devices 1340 and 1345. The input devices 1340 enable the user to communicate information and select commands to the electronic system. The input devices 1340 include alphanumeric keyboards and pointing devices (also called “cursor control devices”), cameras (e.g., webcams), microphones or similar devices for receiving voice commands, etc. The output devices 1345 display images generated by the electronic system or otherwise output data. The output devices 1345 include printers and display devices, such as cathode ray tubes (CRT) or liquid crystal displays (LCD), as well as speakers or similar audio output devices. Some embodiments include devices such as a touchscreen that function as both input and output devices.

Finally, as shown in FIG. 13, bus 1305 also couples electronic system 1300 to a network 1365 through a network adapter (not shown). In this manner, the computer can be a part of a network of computers (such as a local area network (“LAN”), a wide area network (“WAN”), or an Intranet, or a network of networks, such as the Internet. Any or all components of electronic system 1300 may be used in conjunction with the invention.

Some embodiments include electronic components, such as microprocessors, storage and memory that store computer program instructions in a machine-readable or computer-readable medium (alternatively referred to as computer-readable storage media, machine-readable media, or machine-readable storage media). Some examples of such computer-readable media include RAM, ROM, read-only compact discs (CD-ROM), recordable compact discs (CD-R), rewritable compact discs (CD-RW), read-only digital versatile discs (e.g., DVD-ROM, dual-layer DVD-ROM), a variety of recordable/rewritable DVDs (e.g., DVD-RAM, DVD-RW, DVD+RW, etc.), flash memory (e.g., SD cards, mini-SD cards, micro-SD cards, etc.), magnetic and/or solid state hard drives, read-only and recordable Blu-Ray® discs, ultra density optical discs, any other optical or magnetic media, and floppy disks. The computer-readable media may store a computer program that is executable by at least one processing unit and includes sets of instructions for performing various operations. Examples of computer programs or computer code include machine code, such as is produced by a compiler, and files including higher-level code that are executed by a computer, an electronic component, or a microprocessor using an interpreter.

While the above discussion primarily refers to microprocessor or multi-core processors that execute software, some embodiments are performed by one or more integrated circuits, such as application specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs). In some embodiments, such integrated circuits execute instructions that are stored on the circuit itself. In addition, some embodiments execute software stored in programmable logic devices (PLDs), ROM, or RAM devices.

As used in this specification and any claims of this application, the terms “computer”, “server”, “processor”, and “memory” all refer to electronic or other technological devices. These terms exclude people or groups of people. For the purposes of the specification, the terms display or displaying means displaying on an electronic device. As used in this specification and any claims of this application, the terms “computer readable medium,” “computer readable media,” and “machine readable medium” are entirely restricted to tangible, physical objects that store information in a form that is readable by a computer. These terms exclude any wireless signals, wired download signals, and any other ephemeral signals.

While the invention has been described with reference to numerous specific details, one of ordinary skill in the art will recognize that the invention can be embodied in other specific forms without departing from the spirit of the invention. In addition, a number of the figures (including FIGS. 1, 4, and 6) conceptually illustrate processes. The specific operations of these processes may not be performed in the exact order shown and described. The specific operations may not be performed in one continuous series of operations, and different specific operations may be performed in different embodiments. Furthermore, the process could be implemented using several sub-processes, or as part of a larger macro process. Thus, one of ordinary skill in the art would understand that the invention is not to be limited by the foregoing illustrative details, but rather is to be defined by the appended claims. 

What is claimed is:
 1. A non-transitory machine readable medium storing a program for execution by at least one processing unit on a host computer executing a machine that is a source of a large packet flow, the program comprising sets of instructions for: encapsulating a first packet of the large flow using a first header field value for a particular header field of an encapsulating outer header; encapsulating a second packet of the large flow using a second header field value for the particular header field of the encapsulating outer header; wherein the different header field values for the particular header field break the large flow into at least two smaller flows such that at least one subsequent forwarding element, to which the first and second packets is sent from the forwarding element, sends the first and second packets of the large flow along different paths to reach a same destination.
 2. The non-transitory machine readable medium of claim 1, wherein the subsequent forwarding element is a multipathing hardware, wherein the header field is a source port field and the first and second header values are different first and second port numbers, wherein the first and second port numbers are processed by the multipathing hardware to select different paths to send the first and second packets.
 3. The non-transitory machine readable medium of claim 1, wherein the different paths are equal-cost multi-path routing (ECMP) legs.
 4. The non-transitory machine readable medium of claim 1, wherein the program further comprises sets of instructions for: performing a traceroute operation to identify a network map; and identifying the first and second header values based on the network map, wherein the first and second header values are associated with different paths of the network map.
 5. The non-transitory machine readable medium of claim 4, wherein the traceroute operation is a Paris traceroute operation.
 6. The non-transitory machine readable medium of claim 1, wherein the program further comprises a set of instructions for marking each packet in the large flow with a sequence number to deliver the packet in the order that the packet was received.
 7. The non-transitory machine readable medium of claim 6, wherein the program further comprises a set of instructions for marking each packet with an identifier to identify the large flow.
 8. A host computer comprising: a set of processing units for executing machines that generate packet flows for forwarding through a network; and a non-transitory machine readable medium storing a program for execution by at least one processing unit, the program comprising sets of instructions for: encapsulating a first packet of the large flow using a first header field value for a particular header field of an encapsulating outer header; encapsulating a second packet of the large flow using a second header field value for the particular header field of the encapsulating outer header; wherein the different header field values for the particular header field break the large flow into at least two smaller flows such that at least one subsequent forwarding element, to which the first and second packets is sent from the forwarding element, sends the first and second packets of the large flow along different paths to reach a same destination.
 9. The host computer of claim 8, wherein the subsequent forwarding element is a multipathing hardware, wherein the header field is a source port field and the first and second header values are different first and second port numbers, wherein the first and second port numbers are processed by the multipathing hardware to select different paths to send the first and second packets.
 10. The host computer of claim 8, wherein the different paths are equal-cost multi-path routing (ECMP) legs.
 11. The host computer of claim 8, wherein the program further comprises sets of instructions for: performing a traceroute operation to identify a network map; and identifying the first and second header values based on the network map, wherein the first and second header values are associated with different paths of the network map.
 12. The host computer of claim 11, wherein the traceroute operation is a Paris traceroute operation.
 13. The host computer of claim 8, wherein the program further comprises a set of instructions for marking each packet in the large flow with a sequence number to deliver the packet in the order that the packet was received.
 14. The host computer of claim 13, wherein the program further comprises a set of instructions for marking each packet with an identifier to identify the large flow.
 15. A method of handling large flows originating from a machine executing on a host computer, the method comprising: encapsulating a first packet of the large flow using a first header field value for a particular header field of an encapsulating outer header; encapsulating a second packet of the large flow using a second header field value for the particular header field of the encapsulating outer header; wherein the different header field values for the particular header field break the large flow into at least two smaller flows such that at least one subsequent forwarding element, to which the first and second packets is sent from the forwarding element, sends the first and second packets of the large flow along different paths to reach a same destination.
 16. The method of claim 15, wherein the subsequent forwarding element is a multipathing hardware, wherein the header field is a source port field and the first and second header values are different first and second port numbers, wherein the first and second port numbers are processed by the multipathing hardware to select different paths to send the first and second packets.
 17. The method of claim 15, wherein the different paths are equal-cost multi-path routing (ECMP) legs.
 18. The method of claim 15 further comprising: performing a traceroute operation to identify a network map; and identifying the first and second header values based on the network map, wherein the first and second header values are associated with different paths of the network map.
 19. The method of claim 18, wherein the traceroute operation is a Paris traceroute operation.
 20. The method of claim 15 further comprising marking each packet in the large flow with a sequence number to deliver the packet in the order that the packet was received.
 21. The method of claim 20 further comprising marking each packet with an identifier to identify the large flow. 